Using multi-bucket data leaves with overflow chains-performance analysis
نویسنده
چکیده
منابع مشابه
0 63 6 - 19 90
Introduction Many widely used file organizations can be logically partitioned into two components; the index (also called directory) component and the data leaves component. The file records are maintained in data leaves where each data leaf (leaf for short) is one logical unit which is stored in contiguous disk pages. The index component is a search structure, usually a tree or a hash table, w...
متن کاملA Model for an ISAM File with Multiple Overflow Chains
A model for an index sequential file employing multiple overflow chains per bucket is developed. This model is used to analyse the effects of insertions and deletions on the cost of successful and unsuccessful search in terms of block accesses. Numerical results are obtained illustrating the performance. The performance is also compared with that of an ISAM file using only one overflow chain pe...
متن کاملOptimum Storage Allocation for a File in Steady State
A file of fixed-length records in auxiliary storage using a key-to-address transformation to assign records to addresses is considered. The file is assumed to be in steady state, that is that the rates of additions to and of deletions from the file are equal. The loading factors that minimize file maintenance costs in terms of storage space and additional accesses are computed for different buc...
متن کاملData Leaves with Partial Expansions
We present an exact performance analysis, under random insertions, of file organizations that use multi-bucket data leaves and perform partial expansions before splitting. We evaluate the expected disk space utilization of the file, and show how the expected search and insert costs can be estimated. The analytical results are confirmed by simulations. The analysis can be used to investigate bot...
متن کاملAdvanced hashing schemes for packet forwarding using set associative memory architectures
Building a high performance IP packet forwarding (PF) engine remains a challenge due to increasingly stringent throughput requirements and the growing size of IP forwarding tables. The router has to match the incoming packet’s IP address against all entries in the forwarding table. The matching process has to be done at increasingly higher wire speed; hence, scalability and low power consumptio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Syst.
دوره 16 شماره
صفحات -
تاریخ انتشار 1991